To appear in J. Théor. Nombres Bordeaux MINIMAL REDUNDANT DIGIT EXPANSIONS IN THE GAUSSIAN INTEGERS
نویسنده
چکیده
We consider minimal redundant digit expansions in canonical number systems in the Gaussian integers. In contrast to the case of rational integers, where the knowledge of the two least significant digits in the “standard” expansion suffices to calculate the least significant digit in a minimal redundant expansion, such a property does not hold in the Gaussian numbers: We prove that there exist pairs of numbers whose non-redundant expansions agree arbitrarily well but which have different least significant digits in minimal redundant expansions.
منابع مشابه
Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication
This paper investigates some properties of τ -adic expansions of scalars. Such expansions are widely used in the design of scalar multiplication algorithms on Koblitz Curves, but at the same time they are much less understood than their binary counterparts. Solinas introduced the width-w τ -adic non-adjacent form for use with Koblitz curves. This is an expansion of integers z = Pl i=0 ziτ , whe...
متن کاملCounting Optimal Joint Digit Expansions
This paper deals with pairs of integers, written in base two expansions using digits 0,±1. Representations with minimal Hamming weight (number of non-zero pairs of digits) are of special importance because of applications in Cryptography. The interest here is to count the number of such optimal representations.
متن کاملOptimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers
In this paper, we propose the minimal joint Hamming weight conversion for any binary expansions of d integers. With redundant representations, we may represent a number by many expansions, and the minimal joint Hamming weight conversion is the algorithm to select the expansion that has the least joint Hamming weight. As the computation time of the cryptosystem strongly depends on the joint Hamm...
متن کاملFast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers
In this paper, we reduce computation time of elliptic curve signature verification scheme by proposing the minimal joint Hamming weight conversion for any binary expansions of d integers. The computation time of multi-scalar multiplication, the bottleneck operation of the scheme, strongly depends on the joint Hamming weight. As we represent the scalars using redundant representations, we may re...
متن کاملTranscendental numbers having explicit g-adic and Jacobi-Perron expansions
© Université Bordeaux 1, 1992, tous droits réservés. L’accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier do...
متن کامل